基于决策满意度的装备备件配置仿真优化方法

作为装备维修保障体系的重要组成部分,备件的合理配置是装备保障的核心,直接影响装备的使用可用度.而如何在保证装备的使用可用度情况下使备件的保障费用尽可能地减少,是决策者最关心的问题.提出一种基于决策满意度的装备备件配置仿真优化方法,通过蒙特卡罗仿真建立装备使用可用度模型,并在二级维修保障模型进行仿真的基础上,利用模糊多目标优化对备件的使用可用度和备件保障费用这两个指标进行综合评判,最后得到符合决策满意度的备件配置方案.     

多目标模糊微分对策

多目标问题是微分对策研究的一个重要而困难的方面.多目标微分对策是动态向量对策,结合了多目标规划与动态对策,扩大了微分对策在分析冲突问题时解决问题的范围,多具有非线性和不确定性特点.为避免非线性带来求解上的困难和处理不确定信息等,基于T-S模糊微分对策思想,构造出多目标微分对策的模糊线性化模型,然后在模糊线性多目标微分对策系统下对控制器的设计方法作出探讨.对一个1∶2对策问题做了仿真,其效果说明了解决问题方法的可行.     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Rendez‐vous search on a rectangular lattice

In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

互联网中文搜索引擎存在的问题与发展趋势探析

搜索引擎是互联网信息检索技术的核心,中文搜索引擎与国外相比存在着搜索引擎覆盖率低、查准率不高、检索精度差、更新速度慢、无法控制网络信息的动态变化、对信息内容难于控制和管理等问题。对此,提出了中文搜索引擎从单一查询工具向综合化、全功能服务发展;分类主题一体化,检索语言向自然语言发展;查询智能化,向多国化和多语种化发展;搜索引擎集成化、网络资源著录标准化及利用智能代理技术的信息检索等对策。     

多指标下的炮兵火力最优分配

为了提高炮兵火力打击效能,提出了小生境遗传算法与模糊多目标决策相结合的混合算法,建立了多指标下的炮兵火力分配模型,并阐述了混合算法设计,给出了应用举例,结果表明,与传统的单指标下的炮兵火力最优分配相比,该方法更符合战场实际情况。     

求解布尔不可满足子式的消解悖论算法

求解布尔不可满足子式在超大规模集成电路设计与验证领域都具有非常重要的理论与应用价值,帮助EDA工具迅速定位错误与不一致。针对求解不可满足子式的非完全方法,提出了消解悖论与悖论解析树的概念,在此基础上提出一种启发式局部搜索算法。该算法根据公式的消解规则,采用局部搜索过程直接构造证明不可满足性的悖论解析树,而后递归搜索得到不可满足子式;算法中融合了布尔推理技术、动态剪枝方法及蕴含消除方法以提高搜索效率。基于随机测试集进行了实验对比,结果表明提出的算法优于同类算法。     

基于分布搜索的传感器指示交接协商机制

针对传感器指示交接技术中"指示任务怎样执行"的问题,根据指示交接的实际过程,研究了多传感器针对多个协作任务怎样进行更好调度的问题,提出了基于分布搜索的多维协商机制。通过协商函数的迭代更新,不断寻找综合效用最大的传感器调度策略,优化了指示交接过程中多传感器多任务调度过程。实例仿真结果表明,所提方法合理、有效,提高了传感器协作的效率,为指示交接的深入研究奠定了基础。     

针对应急救援路径规划的一种改进蚁群算法

针对不返回起始点、多个待救援点的应急救援路径规划问题,提出了一种应急救援路径规划的改进蚁群算法,设计了一种新的路径构造方法,为蚁群算法求解该类问题打下了基础。为提高收敛性,改进了信息素更新规则,构造了一种与蚁群算法有效结合的局部搜索算法,提高了算法快速寻优的能力。仿真结果表明:改进蚁群算法能够快速找到一条从救援中心到多个待救援点的优化路径,且收敛速度和最短路径较同类算法更优。